Semantic relation extraction with kernels over typed dependency trees.

New filtering approaches for phishing email.

Proceedings of the ACM SIGKDD Workshop on CyberSecurity and Intelligence Informatics

Dependency Tree Kernels for Relation Extraction from Natural Language Text.

Named Entity Recognition of Spoken Documents Using Subword Units.

A Logic%2DBased Approach to Relation Extraction from Texts.

Exploiting Semantic Constraints for Estimating Supersenses with CRFs.

Detecting Known and New Salting Tricks in Unwanted Emails.
Spam and phishing emails are not only annoying to users, but are a real threat to internet communication and web economy. The fight against unwanted emails has become a cat-and-mouse game between criminals and people trying to develop techniques for detecting such unwanted emails. Criminals are constantly developing new tricks and adopt the ones that make emails pass spam filters. We have developed a systems that enables the detection of certain common salting tricks that are employed by criminals. Salting is the intentional addition or distortion of content. In this paper we describe a framework to identify email messages that might contain new, previously unseen tricks. To this end, we compare the simulated perceived email message text generated by our hidden salting simulation system to the OCRed text we obtain from the rendered email message. We present robust text comparison techniques and train a classifier based on the differences of these two texts. In simulations we show that we can detect suspicious emails with a high level of accuracy. 1
Improved Phishing Detection using Model%2DBased Features.

Anticipating Hidden Text Salting in Emails.

Evaluating the Performance of Text Mining Systems on Real%2Dworld Press Archives.

A Brief Survey of Text Mining.
h�p://www.gldv.org/cms/vorstand.php, h�p://www.gldv.org/cms/topics.php � He�e im Jahr, halbjährlich zum ��. Mai und ��. Oktober. Preprints und redaktionelle Planungen sind über die Website der GLDV einsehbar (h�p://www.gldv.org). Unaufgefordert eingesandte Fachbeiträge werden vor Veröffentlichung von mindestens zwei ReferentInnen begutachtet. Manuskripte sollten deshalb möglichst frühzeitig eingereicht werden und bei Annahme zur Veröffentlichung in jedem Fall elektronisch und zusätzlich auf Papier übermi�elt werden. Die namentlich gezeichneten Beiträge geben ausschließlich die Meinung der AutorInnen wieder. Einreichungen sind an die Herausgeber zu übermi�eln. Für Mitglieder der GLDV ist der Bezugspreis des LDV-Forums im Jahresbeitrag mit eingeschlossen. Jahresabonnements können zum Preis von ��,- € (inkl. Versand), Einzelexemplare zum Preis von ��,- € (zzgl. Versandkosten) bei der Redaktion bestellt werden. Christoph Pfeiffer, Regensburg, mit LaTeX (pdfeTeX / MiKTeX)
A Brief Survey of Text Mining.
h�p://www.gldv.org/cms/vorstand.php, h�p://www.gldv.org/cms/topics.php � He�e im Jahr, halbjährlich zum ��. Mai und ��. Oktober. Preprints und redaktionelle Planungen sind über die Website der GLDV einsehbar (h�p://www.gldv.org). Unaufgefordert eingesandte Fachbeiträge werden vor Veröffentlichung von mindestens zwei ReferentInnen begutachtet. Manuskripte sollten deshalb möglichst frühzeitig eingereicht werden und bei Annahme zur Veröffentlichung in jedem Fall elektronisch und zusätzlich auf Papier übermi�elt werden. Die namentlich gezeichneten Beiträge geben ausschließlich die Meinung der AutorInnen wieder. Einreichungen sind an die Herausgeber zu übermi�eln. Für Mitglieder der GLDV ist der Bezugspreis des LDV-Forums im Jahresbeitrag mit eingeschlossen. Jahresabonnements können zum Preis von ��,- € (inkl. Versand), Einzelexemplare zum Preis von ��,- € (zzgl. Versandkosten) bei der Redaktion bestellt werden. Christoph Pfeiffer, Regensburg, mit LaTeX (pdfeTeX / MiKTeX)


Revealing the connoted visual code a new approach to video classification.

Authorship Attribution with Support Vector Machines.
In this paper we explore the use of text-mining methods for the identification of the author of a text.  For the first time we apply the support vector machine (SVM) to this problem. As it is able to cope  with half a million of inputs it requires no feature selection and can process the frequency vector of all  words of a text. We performed a number of experiments with texts from a German newspaper. With  nearly perfect reliability the SVM was able to reject other authors and detected the target author in  60-80% of the cases. In a second experiment we ignored nouns, verbs and adjectives and replaced them  by grammatical tags and bigrams. This resulted in slightly reduced performance. Author detection with  SVM on full word forms was remarkably robust even if the author wrote about different topics.  1 Introduction  As more and more economic and intellectual activities use the world wide web as medium, the scrutiny of the authenticity of a document becomes more and more relevant. An e...
Bayesian regression mixtures of experts for geo%2Dreferenced data.

SVM Classification Using Sequences of Phonemes and Syllables.

SVM Classification Using Sequences of Phonemes and Syllables.

Error Correcting Codes with Optimized Kullback%2DLeibler Distances for Text Categorization.

Multistep Sequential Exploration of Growing Bayesian Classification Models.

Bayesian Classification Trees with Overlapping Leaves Applied to Credit%2DScoring.

Transparency and Predicive Power Explaining Complex Classification Models.

Bayesian Classification Trees with Overlapping Leaves Applied to Credit%2DScoring.



Klassifikation mit Populationen von heterogenen Modellen.

From Recombination of Genes to the Estimation of Distributions I. Binary Parameters.
  The Breeder Genetic Algorithm (BGA) is based on the equation for the response to selection. In order to use this equation for prediction, the variance of the fitness of the population has to be estimated. For the usual sexual recombination the computation can be difficult. In this paper we shortly state the problem and investigate several modifications of sexual recombination. The first method is gene pool recombination, which leads to marginal distribution algorithms. In the last part of the paper we discuss more sophisticated methods, based on estimating the distribution of promising points. 
Estimating Blue%2DGreen Algae Counts with Neurocomputing Techniques.

Bayesian Query Construction for Neural Network Models.

K%FCnstliche Neuronale Netze eine Bestandsaufnahme.

Bericht von der Konferenz %60%60Neural Information Processing Szstems %2D Natural and Synthetic%27%27 %28NIPS%29 1992.

Wissensverarbeitung mit neuronalen Netzen.

Bericht von der Konferenz %60%60Neural Information Processing Szstems %2D Natural and Synthetic%27%27 %28NIPS%29 1992.

Assessing and Improving Neural Network Predictions by the Bootstrap Algorithm.

MESA Maximum Entropy by Simulated Annealing.

European Conference on Symbolic and Quantitative Approaches for Uncertainty.
The mathematical theory of evidence has been introduced by Glenn Shafer in 1976 as a new approach to the representation of uncertainty. This theory can be represented under several distinct but more or less equivalent forms. Probabilistic interpretations of evidence theory have their roots in Arthur Dempster&#039;s multivalued mappings of probability spaces. This leads to random set and more generally to random filter models of evidence. In this probabilistic view evidence is seen as more or less probable arguments for certain hypotheses and they can be used to support those hypotheses to certain degrees. These degrees of support are in fact the reliabilities with which the hypotheses can be derived from the evidence. Alternatively, the mathematical theory of evidence can be founded axiomatically on the notion of belief functions or on the allocation of belief masses to subsets of a frame of discernment. These approaches aim to present evidence theory as an extension of probability theory. ...
Probabilistic Default Reasoning Involving Continous Variables.

Integrating Probabilistic Rules into Neural Networks A Stochastic EM Learning Algorithm.

A Stochastic EM Learning Algorithm for Structured Probabilistic Neural Networks.

Probabilistic Default Reasoning.
We present an approach to reasoning from statistical and subjective knowledge, which is based on a combination of probabilistic reasoning from conditional constraints with approaches to default reasoning from conditional knowledge bases. More precisely, we introduce the notions of -, lexicographic, and conditional entailment for conditional constraints, which are probabilistic generalizations of Pearl&#039;s entailment in system    , Lehmann&#039;s lexicographic entailment, and Geffner&#039;s conditional entailment, respectively. We show that the new formalisms have nice properties. In particular, they show a similar behavior as referenceclass reasoning in a number of uncontroversial examples. The new formalisms, however, also avoid many drawbacks of reference-class reasoning. More precisely, they can handle complex scenarios and even purely probabilistic subjective knowledge as input. Moreover, conclusions are drawn in a global way from all the available knowledge as a whole. We then show that the new formalisms also have nice general nonmonotonic properties. In detail, the new notions of -, lexicographic, and conditional entailment have similar properties as their classical counterparts. In particular, they all satisfy the rationality postulates proposed by Kraus, Lehmann, and Magidor, and they have some general irrelevance and direct inference properties. Moreover, the new notions of - and lexicographic entailment satisfy the property of rational monotonicity. Furthermore, the new notions of -, lexicographic, and conditional entailment are proper generalizations of both their classical counterparts and the classical notion of logical entailment for conditional constraints. Finally, we provide algorithms for reasoning under the new formalisms, and we analyze its computational com...
Second order probabilities for uncertain and conflicting evidence.

Bayesian Integration of Uncertain and Conflicting Evidence.

Anonymit%E4t von Individualdaten in statistischen Datenbanken.

